Representing Median Networks with Concept Lattices
نویسنده
چکیده
Median networks have been proposed as an improvement over trees in phylogenetic analysis. This paper argues that concept lattices represent essentially the same information as median networks but with the advantage that there is a larger FCA research community and a variety of available software tools. Therefore evolutionary analysis is an interesting new application domain for FCA.
منابع مشابه
Concept Lattices and Median Networks
In phylogenetic analysis, median networks have been proposed as an improvement over tree representations. This paper argues that concept lattices represent a further improvement over median networks because FCA provides a detailed formal description and there are a number of existing software solutions for creating lattices. The purpose of this paper is to raise awareness in the FCA community f...
متن کاملA Linear Delay Algorithm for Building Concept Lattices
Concept lattices (also called Galois lattices) have been applied in numerous areas, and several algorithms have been proposed to construct them. Generally, the input for lattice construction algorithms is a binary matrix with size |G||M | representing binary relation I ⊆ G×M . In this paper, we consider polynomial delay algorithms for building concept lattices. Although the concept lattice may ...
متن کاملOn generalized topological molecular lattices
In this paper, we introduce the concept of the generalized topological molecular lattices as a generalization of Wang's topological molecular lattices, topological spaces, fuzzy topological spaces, L-fuzzy topological spaces and soft topological spaces. Topological molecular lattices were defined by closed elements, but in this new structure we present the concept of the open elements and defi...
متن کاملA Graph-Theoretic Method to Representing a Concept Lattice
Concept lattices are indeed lattices. In this paper, we present a new relationship between lattices and graphs: given a binary relation I, we define an underlying graph DI , and find out the constitution in the set of cover elements of the minimum element of the concept lattice of I using the properties of DI . The following is to provide a way to establish a one-to-one correspondence between t...
متن کاملAn Intelligent User Interface for Browsing and Searching MPEG-7 Images Using Concept Lattices
This paper presents the evaluation of a design and architecture for browsing and searching MPEG-7 images. Our approach is novel in that it exploits concept lattices for the representation and navigation of image content. Several concept lattices provide the foundation for the system (called Image-Sleuth) each representing a different search context, one for image shape, another for color and lu...
متن کامل